An Optimal NPV Project Scheduling with Fixed Work Content and Payment on Milestones

نویسنده

  • M. Ranjbar Department of Industrial Engineering, Faculty of Engineering, Ferdowsi University of Mashhad, Mashhad
چکیده مقاله:

    Project scheduling   Net present value   We consider a project scheduling problem with permitted tardiness and discrete time/resource trade-offs under maximum net present value objective. In this problem, a project consists of a set of sequential phases such that each phase contains one or more sub-projects including activities interrelated by finish-start-type precedence relations with a time lag of zero, which require one or more renewable resources. There is also a set of unconstrained renewable resources. For each activity, instead of a fixed duration and known resource requirements, a total work content respect to each renewable resource is given which essentially indicates how much work has to be performed on it. This work content can be performed in different modes, i.e. with different durations and resource requirements as long as the required work content is met. Based on the cost of resources units and resource requirements of each activity, there is a corresponding cash flow for the activity. Each phase is ended with a milestone that corresponds to the phase income. We prove that the mode corresponding to the minimum possible duration of each activity is the optimal mode in this problem. We also present a simple optima scheduling procedure to determine the finish time of each activity .

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

an optimal npv project scheduling with fixed work content and payment on milestones

project scheduling   net present value   we consider a project scheduling problem with permitted tardiness and discrete time/resource trade-offs under maximum net present value objective. in this problem, a project consists of a set of sequential phases such that each phase contains one or more sub-projects including activities interrelated by finish-start-type precedence relations with a time ...

متن کامل

An Optimal Project Scheduling Model with Lump-Sum Payment

Project scheduling is essential in enterprise operations. Not only does it increase working efficiency but also the enterprise’s profit. In the past, there have been studies developing heuristic algorithms to efficiently solve the complicated multi-mode resource constrained project scheduling problem with discounted cash flows (MRCPSPDCF). These obtained solutions are approximate rather than op...

متن کامل

Work patterns in project scheduling

In project planning and control it is of vital importance to take into account that diierent categories of resources have diierent work patterns. Algorithms for time analysis, resource smoothing and resource scheduling are almost always presented as if this has no importance. Practical planning tools, however, have diierent work patterns as a natural part of the data. In this paper, we discuss ...

متن کامل

in translation: translators on their work and what it means

کتاب در باب ترجمه، اثر استر آلن و سوزان برنوفسکی منتشر شده در ماه می 2013 توسط نشریه کلمبیا است. نویسندگان در این کتاب به بررسی 18 مترجم با در نظر گرفتن نقش آثاری که این مترجمان ترجمه کرده اند میپردازند. کتاب به دو بخش تقسیم میشود: " مترجم در جهان" و " کار مترجم" این دو بخش مقالات همیشگی ترجمه و موقعیت خاص ادبیات بیگانه در جهان وسیع امروزی را مورد خطاب قرار میدهد. در این کتاب مقالات متعددی از ن...

Can Fixed Priority Scheduling Work in Practice?

In this paper we are primarily concerned with embedded real-time systems such as mobile phones or personal communication devices. Today personal communication devices are more than voice call terminals. Mobile phones serve as platforms for a variety of mobile applications including text and picture messaging as well as personal information management, including data synchronization with remote ...

متن کامل

Optimal Fixed Interval Satellite Range Scheduling

The satellite scheduling community has provided several algorithms for allocating interaction windows between ground stations and satellites, from simple greedy approaches to more complex hybrid-genetic or Lagrangian-relaxation techniques. Single-location ground station problems, where requests have fixed time intervals and no priorities, are known to be solvable in polynomial time. To the best...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 22  شماره 3

صفحات  181- 186

تاریخ انتشار 2011-09

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

کلمات کلیدی

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023